Dynamic Management of Virtual Infrastructures
نویسندگان
چکیده
منابع مشابه
Cost optimization of virtual infrastructures in dynamic multi-cloud scenarios
The number of providers in the cloud computing market is increasing at a rapid pace. They offer a wide range of pricing schemes, different types of instance, or even different value-added features to differ from other competitors, making the cloud market more complex. Cloud brokering enable users to choose the best cloud provider for their needs and avoid particular providers’ lock in. Moreover...
متن کاملEnhancing Ad Hoc Routing with Dynamic Virtual Infrastructures
Several routing algorithms for mobile ad hoc networks (MANETs) have been proposed in the recent past [1], [2], [3]. With the exception of a few, these protocols (i) involve all nodes in the route management process, (ii) rely on the use of broadcast relays for route computation, and (iii) are primarily reactive in nature. Related work [4], [5] has shown that the capacity utilization in ad hoc n...
متن کاملVirtual Resource Management for Data Intensive Applications in Cloud Infrastructures
Cloud computing describes the model of a scalable resource provisioning technology that redirects the possibility of hardware and software leasing to the Internet, through the use of an equitable pay-per-use strategy. In this paper we present a new provisioning mechanism in Clouds used for large-scale data-intensive computing. Our project addresses the key requirements in managing resources at ...
متن کاملDynamic Privilege Management Infrastructures Utilising Secure Attribute Exchange
Technologies which implement dynamic privilege management infrastructures will be crucial to the secure sharing of resources on the Grid, especially as the number of resources and participating sites increases. The DyVOSE project has successfully deployed Grid services secured with the PERMIS authorisation software implementing a static Privilege Management Infrastructure (PMI) model. The secon...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Grid Computing
سال: 2014
ISSN: 1570-7873,1572-9184
DOI: 10.1007/s10723-014-9296-5